On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
نویسنده
چکیده
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multipath-constrained (MCP) or multi-constrained optimal-path (MCOP) quality of service (QoS) routing problems, which are NP-complete. Heuristic algorithm H MCOP proposed by Korkmaz et al. has been widely recognized for its low time complexity and high probability of finding feasible solutions. In this paper, the performance of this heuristic is reinvestigated under several special cases. Simulation results indicate that in some cases its probability of finding feasible solutions is unexpectedly low. Such observation, which is further used to explain the performance of a heuristic based on H MCOP, would be of extreme importance when designing any higher-level QoS routing algorithms that need to use H MCOP to find feasible solutions.
منابع مشابه
Heuristic and Exact Algorithms for QoS Routing with Multiple Constraints ∗
The modern network service of finding the optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multiconstrained optimal-path (MCOP) QoS routing problem, which is NP-complete. In this paper, this problem is solved through both exact and heuristic algorithms. We propose an exact algorithm E MCOP, which first constructs...
متن کاملOptimal QoS Routing Based on Extended Simulated Annealing
Quality-of-service routing (QoSR) is to find an optimal path that satisfies multiple constraints simultaneously. As an NPC problem, it is a challenge for the next-generation networks. In this paper, we propose a novel heuristic SA MCOP to the general multi-constrained optimal path problem by extending simulated annealing into Dijkstra’s algorithm. The heuristic first translates multiple QoS wei...
متن کاملExact Algorithms for Multi-Constrained QoS Routing
The modern network service of finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multi-path constrained (MCP) or multi-constrained optimal-path (MCOP) QoS routing problems, which are NP-complete. In this paper, these problems are solved through exact algorithms. Even though exact algorithms...
متن کاملMulti-Constrained Optimal Path Selection
Providing quality-of-service (QoS) guarantees in packet networks gives rise to several challenging issues. One of them is how to determine a feasible path that satisfies a set of constraints while maintaining high utilization of network resources. The latter objective implies the need to impose an additional optimality requirement on the feasibility problem. This can be done through a primary c...
متن کاملA survey on multi-constrained optimal path computation: Exact and approximate algorithms
The paper presents a survey on the techniques to solve the multi-constrained optimal path (MCOP) problem. Computing the MCOP is a task shared by many research areas, from transportation systems to telecommunication networks. In the latter, the MCOP is often related to the issue of Quality of Service (QoS) routing, which consists in finding a route between a couple of nodes that meets a series o...
متن کامل